Equality of decomposable symmetrized tensors and ∗-matrix groups
نویسندگان
چکیده
منابع مشابه
On the Structure Groups of Decomposable Algebraic Curvature Tensors
This paper examines the action of GLN (R) on decomposable algebraic curvature tensors. The main result is that the structure group of a decomposable algebraic curvature tensor can only permute the subspaces into which the tensor decomposes: if the tensor decomposes into tensors Ri on Vi where V = ⊕k i=1 Vi, then for any matrix A in the structure group there exists a permutation σ such that A : ...
متن کاملVanishing of Doubly Symmetrized Tensors
Symmetrizations of tensors by irreducible characters of the symmetric group serve as natural analogues of symmetric and skew-symmetric tensors. The question of when a symmetrized decomposable tensor is non-zero is intimately related to the rank partition of a matroid extracted from the tensor. In this paper we characterize the non-vanishing of the symmetrization of certain partially symmetrized...
متن کاملComputable Completely Decomposable Groups
A completely decomposable group is an abelian group of the form ⊕ i Hi, where Hi ≤ (Q,+). We show that every computable completely decomposable group is ∆5-categorical. We construct a computable completely decomposable group which is not ∆4-categorical, and give an example of a computable completely decomposable group G which is ∆4-categorical but not ∆3-categorical. We also prove that the inde...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولSuccessive Rank-One Approximations of Nearly Orthogonally Decomposable Symmetric Tensors
Many idealized problems in signal processing, machine learning and statistics can be reduced to the problem of finding the symmetric canonical decomposition of an underlying symmetric and orthogonally decomposable (SOD) tensor. Drawing inspiration from the matrix case, the successive rank-one approximations (SROA) scheme has been proposed and shown to yield this tensor decomposition exactly, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1983
ISSN: 0024-3795
DOI: 10.1016/0024-3795(83)90103-9